Social Science and Computer Technology Assessment: Some Organizing Principles and Indicators
نویسندگان
چکیده
منابع مشابه
Global Journal of Computer Science and Technology
This paper proposes a transformation scheme for rendering the asymmetric watermarking technique into its asymmetric version. The asymmetric technique uses secret watermark as private key and public watermark as public key. The public watermark has a normal distribution and the private watermark is a linear combination of the public watermark and a secret sequence. The detection process is imple...
متن کاملGlobal Journal of Computer Science and Technology
Data security has become a major issue in most network protocols. For wireless system, security support is even more important to protect the users as well as the network. Due to this importance, different protocol were designed & deployed with network standards in order to add the security. The security sub layer of IEEE 802.16 employs an authenticated client/server key management protocol in ...
متن کاملGlobal Journal of Computer Science and Technology
In this paper, we analyze the characteristics of the dynamic job shop scheduling problem when machine breakdown and new job arrivals occur. A hybrid approach involving neural networks(NNs) and geneticalgorithm(GA) is presented to solve the dynamic job shop scheduling problem as a static scheduling problem. The objective of this kind of job shop scheduling problem is minimizing the completion ti...
متن کاملGlobal Journal of Computer Science and Technology
The major concern of almost all the verification system is user authentication and security. This necessitates the development of a mechanism that ensures user security and privacy. A lot of research has been carried on this developing field and numerous techniques have been proposed earlier in literature. These traditional methods use tokens and passwords to provide security to the users. Unce...
متن کاملGlobal Journal of Computer Science and Technology
Adleman and Lipton adopted a brute-force search strategy to solve NP-complete problems by DNA computing i.e., a DNA data pool containing the full solution space must first be constructed in the initial test tube (t0), and then correct answers are extracted and/or false ones are eliminated from the data pool step by step. Thus, the number of distinct DNA strands contained in the initial test tub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IASSIST Quarterly
سال: 1996
ISSN: 0739-1137,0739-1137
DOI: 10.29173/iq563